Spreading Barrier
نویسندگان
چکیده
منابع مشابه
Breaking the log n barrier on rumor spreading
O(log n) rounds has been a well known upper bound for rumor spreading using push&pull in the random phone call model (i.e., uniform gossip in the complete graph). A matching lower bound of Ω(logn) is also known for this special case. Under the assumption of this model and with a natural addition that nodes can call a partner once they learn its address (e.g., its IP address) we present a new di...
متن کاملDoes “Q-Spreading” Come with Presupposition Spreading?
The goal of this study is to introduce a new type of evidence to the debate on the nature of what is known in the literature as quantifier spreading (q-spreading), also referred to as the “symmetry error”. Since the work of Inhelder and Piaget (1964), it has been known that until the age of 7–8, children’s responses are frequently different from those of adults when judging the truth-value of s...
متن کاملSpreading mitochondria
JCB • VOLUME 172 • NUMBER 4 • 2006 482 M itochondria are passed from cell to cell, as shown by Jeffrey Spees, Scott Olson, Mandolin Whitney, and Darwin Prockop (Tulane University, New Orleans, LA). Prockop’s group stumbled across this remarkable ability while studying bone marrow stem cells (MSCs), which were particularly social in culture, often touching each other and then backing off. Small ...
متن کاملSoftware Faults : Spreading, Detection and Costs the Spreading of One Fault 2 the Spreading Model
The paper considers, through modelling, how software faults are spread throughout the entire life-cycle of a large software product and how fault detection and correction processes will affect the spreading mechanism. The study is further enlarged to incorporate models for cost estimation. The models can be described as being of a qualitative rather than a quantitative nature, in that they high...
متن کاملInitial Spreading
With most internet connections being short–lived (i.e. ~10 segments), it is very tempting to enlarge the TCP Initial Window (IW). This would save two of the three RTTs needed to transfer most of the web pages through a legacy slow start. However it has been demonstrated that the bursts created by a larger IW greatly impair global performance. An intuitive solution is the TCP Pacing. By spreadin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 2010
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.327.5970.1181-b